Density estimation of shortest path lengths in spatial stochastic networks
نویسندگان
چکیده
We consider a spatial stochastic model for telecommunication networks, the stochastic subscriber line model, and we investigate the distribution of the typical shortest path length between network components. Therefore, we derive a representation formula for the probability density of this distribution which is based on functionals of the so-called typical serving zone. Using this formula, we construct an estimator for the density of the typical shortest path length and we analyze the statistical properties of this estimator. Moreover, we introduce new simulation algorithms for the typical serving zone which are used in a numerical study in order to estimate the density and moments of the typical shortest path length for different specific models.
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملAn Estimation of the Shortest and Largest Average Path Length in Graphs of Given Density
Many real world networks (graphs) are observed to be ’small worlds’, i.e., the average path length among nodes is small. On the other hand, it is somewhat unclear what other average path length values networks can produce. In particular, it is not known what the maximum and the minimum average path length values are. In this paper we provide a lower estimation for the shortest average path leng...
متن کاملA Parametric Copula Approach for Modelling Shortest-Path Trees in Telecommunication Networks
Abstract. We extend the Stochastic Subscriber Line Model by the introduction of shortest-path trees which are obtained by splitting up the segment system of the typical serving zone at its crossings and endings. Due to reasons in the complex field of cost and capacity estimation in telecommunication networks, it is desirable to gain knowledge about distributional properties of the branches of t...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملCapacity Distributions in Spatial Stochastic Models for Telecommunication Networks
We consider the stochastic subscriber line model as a spatial stochastic model for telecommunication networks and we are interested in the evaluation of the required capacities at different locations of the network in order to provide, in fine, an estimation of the cable system which has to be installed. In particular, we consider hierarchical telecommunication networks with higher–level compon...
متن کامل